#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SIZE 100000 + 1
int main(){
int tc;cin>>tc;
while(tc--){
int n;cin>>n;
int cnt;
for(int i=1;i<=n;++i){
if(n%i==0)continue;
else{
cnt = i;break;
}
}
string res = "";
string temp = "";
for(int i=0;i<cnt;++i){
temp+='a'+i;
}
while(res.size()<n){
res+=temp;
}
string ans = "";
for(int i=0;i<n;++i){
ans+=res[i];
}
cout<<ans<<endl;
}
}
1108B - Divisors of Two Integers | 1175A - From Hero to Zero |
1141A - Game 23 | 1401B - Ternary Sequence |
598A - Tricky Sum | 519A - A and B and Chess |
725B - Food on the Plane | 154B - Colliders |
127B - Canvas Frames | 107B - Basketball Team |
245A - System Administrator | 698A - Vacations |
1216B - Shooting | 368B - Sereja and Suffixes |
1665C - Tree Infection | 1665D - GCD Guess |
29A - Spit Problem | 1097B - Petr and a Combination Lock |
92A - Chips | 1665B - Array Cloning Technique |
1665A - GCD vs LCM | 118D - Caesar's Legions |
1598A - Computer Game | 1605A - AM Deviation |
1461A - String Generation | 1585B - Array Eversion |
1661C - Water the Trees | 1459A - Red-Blue Shuffle |
1661B - Getting Zero | 1661A - Array Balancing |